Minimizing Polynomial Functions
نویسندگان
چکیده
We compare algorithms for global optimization of polynomial functions in many variables. It is demonstrated that existing algebraic methods (Gröbner bases, resultants, homotopy methods) are dramatically outperformed by a relaxation technique, due to N.Z. Shor and the first author, which involves sums of squares and semidefinite programming. This opens up the possibility of using semidefinite programming relaxations arising from the Positivstellensatz for a wide range of computational problems in real algebraic geometry.
منابع مشابه
Minimizing Discrete Convex Functions with Linear Inequality Constraints
A class of discrete convex functions that can efficiently be minimized has been considered by Murota. Among them are L\-convex functions, which are natural extensions of submodular set functions. We first consider the problem of minimizing an L\-convex function with a linear inequality constraint having a positive normal vector. We propose a polynomial algorithm to solve it based on a binary se...
متن کاملCorrigendum to “Rational rotation-minimizing frames
The existence of rational rotation–minimizing frames on polynomial space curves is characterized by the satisfaction of a certain identity among rational functions. Part 2 of Remark 5.1 in the original paper states an inequality among the degrees of the denominators of these rational functions, but the proof given therein was incomplete. A formal proof of this inequality, which is essential to ...
متن کاملSufficient Conditions for a New Class of Polynomial Analytic Functions of Reciprocal Order alpha
In this paper, we consider a new class of analytic functions in the unit disk using polynomials of order alpha. We give some sufficient conditions for functions belonging to this class.
متن کاملAn FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
We consider the problem of minimizing a class of quasi-concave functions over a convex set. Quasiconcave functions are a generalization of concave functions and thus, NP-hard to minimize over a convex set in general. We present a simple fully polynomial time approximation scheme (FPTAS) for minimizing a fairly general class of low-rank quasi-concave functions. Our algorithm is based on solving ...
متن کاملTutte polynomials of wheels via generating functions
We find an explicit expression of the Tutte polynomial of an $n$-fan. We also find a formula of the Tutte polynomial of an $n$-wheel in terms of the Tutte polynomial of $n$-fans. Finally, we give an alternative expression of the Tutte polynomial of an $n$-wheel and then prove the explicit formula for the Tutte polynomial of an $n$-wheel.
متن کاملCoupled systems of equations with entire and polynomial functions
We consider the coupled system$F(x,y)=G(x,y)=0$,where$$F(x, y)=bs 0 {m_1} A_k(y)x^{m_1-k}mbox{ and } G(x, y)=bs 0 {m_2} B_k(y)x^{m_2-k}$$with entire functions $A_k(y), B_k(y)$.We derive a priory estimates for the sums of the rootsof the considered system andfor the counting function of roots.
متن کامل